From the Emeritus Founding Editors

Founding and Former Series Editors:

It is well-known that there is an efficient method for decrypt-ing/signing with RSA when the secret exponent d is small modulo p− 1and q − 1. We call such an exponent d a small CRT-exponent. It is one of the major open problems in attacking RSA whether there exists a polynomial time attack for small CRT-exponents, i.e. a result that can be considered as an equivalent to the Wiener and B...

Commenced Publication in 1973 Founding and Former Series Editors:

The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we describe a method to search for characteristics in an automatic way. This is particularly useful for multi-block attacks, and as a proof of concept, we give a two-block collision for 64-step SHA-1 based on a new char...

From the Founding Editor

ASL is gearing up for change in looks, content as well as its name. About 27 years after it was launched, ASL is undergoing a complete transformation to meet fresh challenges of the new millennium. The journal will have a new look and feel, its advisory committee reconstituted, a more efficient peer review process and an online platform for submission and review of research papers. Very soon, a...

From the Guest Editors

The dependability of systems is known as the reliance that can justifiably be placed on the service the system delivers. Dependability has become an important aspect of computer systems since everyday life increasingly depends on them, which has left us vulnerable to their potential malfunction. The causes to these malfunctions can potentially be introduced in every step of their development, d...

Message from the Editors